A new class of nonlinear PN sequences over GF(qn)
نویسنده
چکیده
A new class of pseudo-random sequences (called cascaded GMW-type permutation polynomial (CGPP) sequences) over GF (qn) is constructed using a system of n orthogonal cascaded GMW functions in GF (q). Their statistical properties are given. Classification, evaluation, and implementation of the CGPP sequences are derived. A sequence generated by mapping elements of a CGPP sequence into GF (q) is also presented.
منابع مشابه
Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences
Let Pn and Qn be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomials we develop relations among their values, which are then applied to various numerical sequences which occur as values of the Pn and Qn. For example, Pn(0) and Qn(0) are respectively the nth tangent and secant number...
متن کاملOn SL(2, R) valued cocycles of Hölder class with zero exponent over Kronecker flows
We show that a generic SL(2,R) valued cocycle in the class of C, (0 < r < 1) cocycles based on a rotation flow on the d-torus, is either uniformly hyperbolic or has zero Lyapunov exponents provided that the components of winding vector γ̄ = (γ, · · ·, γ) of the rotation flow are rationally independent and satisfy the following super Liouvillian condition : |γ − pn qn | ≤ Ce 1+δ n , 1 ≤ i ≤ d , n...
متن کاملExistence Theorems of Periodic Solutions for Second-Order Nonlinear Difference Equations
In 1.1 , the given real sequences {pn}, {qn} satisfy pn T pn > 0, qn T qn for any n ∈ Z, f : Z×R → R is continuous in the second variable, and f n T, z f n, z for a given positive integer T and for all n, z ∈ Z×R. −1 δ −1, δ > 0, and δ is the ratio of odd positive integers. By a solution of 1.1 , we mean a real sequence x {xn}, n ∈ Z, satisfying 1.1 . In 1, 2 , the qualitative behavior of linea...
متن کاملDistributions Modulo Subgroups of GF(q)
We consider recursive sequences over GF(q) (the Galois field with q elements) generated by an irreducible polynomialfof degree 12. All roots of f have the same order e (called the exponent off) in the multiplicative group GF(qn)* = GF(q”) (0). Every nonzero recursive sequence generated byf is periodic with period e, and there are (up to translation) (4% 1)/e nonzerof-sequences [l], [2]. If e = ...
متن کاملWhen do linear combinations of orthogonal polynomials yield new sequences of orthogonal polynomials?
Given {Pn}n≥0 a sequence of monic orthogonal polynomials, we analyze their linear combinations with constant coefficients and fixed length, i.e., Qn(x) = Pn(x) + a1Pn−1(x) + · · ·+ akPn−k, ak 6= 0, n > k. Necessary and sufficient conditions are given for the orthogonality of the sequence {Qn}n≥0. An interesting interpretation in terms of the Jacobi matrices associated with {Pn}n≥0 and {Qn}n≥0 i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997